Long cycles in graphs with no subgraphs of minimal degree 3
نویسندگان
چکیده
منابع مشابه
Long paths and cycles in random subgraphs of graphs with large minimum degree
For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p. We prove that (i) if p ≥ ω/k for a function ω = ω(k) that tends to infinity as k does, then Gp asymptotically almost surely contains a cycle (and thus a path) of length at least (1− o(1))k, and (ii) if p ≥ (1 + o(1)) ln k/k, then Gp asymptotica...
متن کاملCycles and paths in graphs with large minimal degree
Let G be a simple graph of order n and minimal degree > cn (0 < c < 1=2). We prove that (1) There exist n0 1⁄4 n0(c) and k 1⁄4 k(c) such that if n > n0 and G contains a cycle Ct for some t > 2k ; then G contains a cycle Ct 2s for some positive s < k ; (2) Let G be 2-connected and nonbipartite. For each " (0 < " < 1), there exists n0 1⁄4 n0(c; ") such that if n n0 then G contains a cycle Ct for ...
متن کاملLong cycles in subgraphs of (pseudo)random directed graphs
We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every 0 < γ < 1/2 we find a constant c = c(γ) such that the following holds. Let G = (V,E) be a (pseudo)random directed graph on n vertices and with at least a linear number of edges, and let G′ be a subgraph of G with (1/2 + γ)|E| edges. Then G′ contains a directe...
متن کاملGraphs without proper subgraphs of minimum degree 3 and short cycles
We study graphs on n vertices which have 2n − 2 edges and no proper induced subgraphs of minimum degree 3. Erdős, Faudree, Gyárfás, and Schelp conjectured that such graphs always have cycles of lengths 3, 4, 5, . . . , C(n) for some function C(n) tending to infinity. We disprove this conjecture, resolve a related problem about leaf-to-leaf path lengths in trees, and characterize graphs with n v...
متن کاملLong cycles in graphs with large degree sums
A number of results are established concerning long cycles in graphs with large degree sums. Let G be a graph on n vertices such that d(x) + d(y) + d(z) 3s for all triples of independent vertices x, y, z. Let c be the length of a longest cycle in G and (Y the cardinality of a maximum independent set of vertices. If G is l-tough and s an, then every longest cycle in G is a dominating cycle and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90077-0